SDL and Timed Petri Nets versus UPPAAL for the validation of embedded architecture in automotive
نویسندگان
چکیده
The emergence of new technologies in the automotive domain implies new characteristics and new constraints. The X-by-wire technology tends to replace mechanical components by electronic parts, implying distributed real-time broadcast architecture. These systems support safety-critical applications, as for example the steering control function. Thus they require hard constraints, both in the temporal and the fault-tolerance domain. In this context, one of the specific designed architectures is TTA (Time-Triggered Architecture) [Kop98], based on TTP/C (Time-Triggered Protocol for class C applications) [KG94], [TTT02]. This architecture is a hard real-time and fault-tolerant one, providing services developed to respect these specific temporal and fault-tolerant constraints. Obviously, such a design must be validated for the constraints it is supposed to support, even in presence of faults. Formal validation is a validation method based on the verification of constraints in a model of the system. It allows the exhaustive analysis of the system behavior, and an automatic verification. In this purpose various validation methods can be used, the choice mainly depends on the type of constraints to be validated and the characteristics of the target system. Consequently, the first important step of the validation process is the choice of a modeling formalism and an associated analysis method which correspond to the characteristics of the system. The study presented in this paper deals with the temporal validation of the TTA architecture. It presents a comparison between two different approaches. The first one is based on the use of two different modeling formalisms (namely SDL and Timed Petri Nets) for the different parts of TTA, and their association for the validation of the whole architecture. The second approach is the modeling and the analysis of the whole architecture with only one formalism : the Timed Safety Automata of UPPAAL ([BY04]). The first part of this article motivates the comparison between two validation approaches. Then the two following parts present respectively the first and the second approach, with some results on the validation of TTA. Finally the fourth part concludes this comparison.
منابع مشابه
A rule-based evaluation of ladder logic diagram and timed petri nets for programmable logic controllers
This paper describes an evaluation through a case study by measuring a rule-based approach, which proposed for ladder logic diagrams and Petri nets. In the beginning, programmable logic controllers were widely designed by ladder logic diagrams. When complexity and functionality of manufacturing systems increases, developing their software is becoming more difficult. Thus, Petri nets as a high l...
متن کاملUsing Interval Petri Nets and Timed Automata for Diagnosis of Discrete Event Systems (DES)
A discrete event system (DES) is a dynamic system that evolves in accordance with the abrupt occurrence, at possibly unknown irregular intervals, of physical events. Because of the special nature of these systems, different tools are currently used for their analysis, design and modeling. The main focus of this paper is the presentation of a new modeling approach of Discrete Event Systems. The ...
متن کاملAn Integrated Approach to Modeling and Analysis of Embedded Real-Time Systems Based on Timed Petri Nets
In computer-based control systems, embedded software is taking over what mechanical and dedicated electronic systems used to do, that is, to engage and control the physical world, interacting directly with sensors and actuators. Therefore, software running on a digital processor is tightly-coupled with its surrounding physical environment. We propose an integrated approach based on Timed Petri-...
متن کاملAn M-Net Semantics for a Real-Time Extension of µSDL
In this paper an extension of SDL by real-time assertions is suggested. A denotational compositional semantics in terms of timed high level Petri nets is given. This semantics allows to reason about timed SDL-speciications by simulation of the underlying high level nets as well as by unfolding these into timed low level nets and then applying analysis methods for timed Petri nets or temporal mo...
متن کاملAn Efficient Translation of Timed-Arc Petri Nets to Networks of Timed Automata
Bounded timed-arc Petri nets with read-arcs were recently proven equivalent to networks of timed automata, though the Petri net model cannot express urgent behaviour and the described mutual translations are rather inefficient. We propose an extension of timed-arc Petri nets with invariants to enforce urgency and with transport arcs to generalise the read-arcs. We also describe a novel translat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004